Norman Do The Art of Tiling with Rectangles 1

نویسنده

  • Norman Do
چکیده

Tiling pervades the art and architecture of various ancient civilizations. Toddlers grapple with tiling problems when they pack away their wooden blocks and home renovators encounter similar problems in the bathroom. However, rather than being a frivolous pastime, mathematicians have found the art of tiling to be brimming with beautiful mathematics, problems of fiendish difficulty, as well as important applications to the physical sciences. In this article, we will consider some of the more surprising results from the art of tiling with rectangles. One of the most famous of tiling conundrums is the following, a problem which almost every mathematician must have encountered at one time or another. Consider the regular 8 × 8 checkerboard which has been mutilated by removing two squares from opposite corners. How many ways are there to tile the remaining board with dominoes which can cover two adjacent squares? The answer to this problem, which may seem surprising to an unsuspecting audience, is that it is impossible to tile the mutilated checkerboard. Prior to removing the two squares, there is a myriad of ways to perform such a domino tiling — actually, 3604 = 12988816 ways to be precise! So why should such a trivial alteration of the board reduce this number to zero? The argument is stunning in its simplicity and the key to the solution lies in the seemingly unimportant colouring of the checkerboard into black and white squares. Of course, this colouring is such that the placement of any domino on the board will cover exactly one square of each colour. Thus, a necessary condition for the board to be tiled by dominoes is that there are an equal number of black and white squares. However, in mutilating our checkerboard, we have removed two squares of the same colour from a board that previously had 32 of each. From this disparity, we are led to the conclusion that the mutilated checkerboard cannot be tiled by dominoes, no matter how hard one might try.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Tilings of Quadrants and Rectangles and Rectangular Pattern

The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...

متن کامل

Tiling a Polygon with Rectangles

We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). We present a linear time algorithm for deciding if a polygon can be tiled with 1 m and k 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m k and k m.

متن کامل

Tiling a Polygon with Two Kinds of Rectangles

We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon F as input, produces a tiling of F with translated copies of our rectangles (or indicates that there is no tiling). Moreover, we prove that any pair of tilings can be linked by a sequence of local transformations of tilings, called flips. This study is based on the use of J. H. Conway’s tili...

متن کامل

A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

متن کامل

The Z Alpern Multi-tower Theorem for Rectangles: a Tiling Approach

We provide a proof of the Alpern multi-tower theorem for Z d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z action by a collection of rectangles whose corresponding sides have no non-trivial common divisors. We associate to such a collection of rectangles a special family of generalized domino tilings. We then identify an intrinsic dynamic property of these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005